APLicative Programming with Naperian Functors
نویسنده
چکیده
Array-oriented programming languages such as APL [1] and J [2] pay special attention to manipulating array structures: rank-one vectors (sequences of values), rank-two matrices (which can be seen as rectangular sequences of sequences), rank-three cuboids (sequences of sequences of sequences), rank-zero scalars, and so on. One appealing consequence of this unification is the prospect of rank polymorphism [7]—that a scalar function may be automatically lifted to act element-by-element on a higher-ranked array, a scalar binary operator to act pointwise on pairs of arrays, and so on. For example, numeric function square acts not only on scalars, but also on vectors:
منابع مشابه
Constructing Applicative Functors
Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications. This paper sets out to explore the space of non-monadic applicative functors useful in programming. We work with a generalization, lax monoidal functors, and consider several methods of co...
متن کاملFunctors Induced by Cauchy Extension of C$^ast$-algebras
In this paper, we give three functors $mathfrak{P}$, $[cdot]_K$ and $mathfrak{F}$ on the category of C$^ast$-algebras. The functor $mathfrak{P}$ assigns to each C$^ast$-algebra $mathcal{A}$ a pre-C$^ast$-algebra $mathfrak{P}(mathcal{A})$ with completion $[mathcal{A}]_K$. The functor $[cdot]_K$ assigns to each C$^ast$-algebra $mathcal{A}$ the Cauchy extension $[mathcal{A}]_K$ of $mathcal{A}$ by ...
متن کاملVanishing of Ext-Functors and Faltings’ Annihilator Theorem for relative Cohen-Macaulay modules
et be a commutative Noetherian ring, and two ideals of and a finite -module. In this paper, we have studied the vanishing and relative Cohen-Macaulyness of the functor for relative Cohen-Macauly filtered modules with respect to the ideal (RCMF). We have shown that the for relative Cohen-Macaulay modules holds for any relative Cohen-Macauly module with respect to with ........
متن کاملA Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling
We present a higher-order module discipline with separate compilation and concurrent dynamic linking. Based on first-order modules one can program security policies for systems that link modules from untrusted locations (e.g., Java). We introduce a pickling operation that writes persistent clones of volatile, possibly higher-order data structures on the file system. Our pickling operation respe...
متن کاملFree Applicative Functors
Applicative functors [6] are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language, like Haskell [5]. Applicative functors are to be preferred to monads when the structure of a computation is fixed a priori. That makes it possible to perform certain kinds of static analysis on applicative values. We define a notion of free applicative fu...
متن کامل